Selection and signaling of motion vector (MV) precisions

ABSTRACT

A decoder including a receiver and a processor configured to receive an encoded bitstream containing a motion vector (MV) candidate index for a current block. The processor is coupled to the receiver, and configured to obtain precisions of candidate motion vectors (MVs) corresponding to neighboring blocks of the current block, perform first rounding of the precisions based on a rounding scheme, perform second rounding of the candidate MVs based on the first rounding, perform pruning of the candidate MVs, generate a candidate list based on the second rounding and the pruning, and select one of the candidate MVs from the candidate list for decoding the current block based on the MV candidate index.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. non-provisional patentapplication Ser. No. 15/982,865 filed on May 17, 2018 by FutureweiTechnologies, Inc. and titled “Motion Vector Prediction and MergeCandidate Selection,” which claims priority to U.S. provisional patentapplication No. 62/518,402 filed on Jun. 12, 2017 by FutureweiTechnologies, Inc. and titled “Motion Vector Prediction and MergeCandidate Selection,” each of which is incorporated herein by reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

REFERENCE TO A MICROFICHE APPENDIX

Not applicable.

BACKGROUND

Videos use a relatively large amount of data, so communication of videosuses a relatively large amount of bandwidth. However, many networksoperate at or near their bandwidth capacities. In addition, customersdemand high video qualities, which require using even more data. Thereis therefore a desire to both reduce the amount of data videos use andimprove the video qualities. One solution is to compress videos duringan encoding process and decompress the videos during a decoding process.Improving compression and decompression techniques is a focus ofresearch and development.

SUMMARY

According to one aspect of the present disclosure, there is provided areceiver configured to receive an encoded bitstream containing a motionvector (MV) candidate index for a current block; and a processor coupledto the receiver, the processor configured to: obtain candidate motionvectors (MVs) corresponding to neighboring blocks of the current block,the neighboring blocks neighbor the current block; obtain precisions ofcandidate MVs corresponding to neighboring blocks of the current block;perform first rounding of the precisions based on a rounding scheme;perform second rounding of the candidate MVs based on the firstrounding; perform pruning of the candidate MVs; generate a candidatelist based on the second rounding and the pruning; and select one of thecandidate MVs from the candidate list for decoding the current blockbased on the MV candidate index.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the neighboring blocks comprise a firstneighboring block and a second neighboring block, and wherein theprecisions comprise a first precision of the first neighboring block anda second precision of the second neighboring block.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the rounding scheme comprises: rounding thefirst precision to a target precision of the current block; and roundingthe second precision to the target precision.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the rounding scheme comprises: determining alowest precision from among any combination of the first precision, thesecond precision, and a target precision of the current block; androunding at least one of the first precision, the second precision, orthe target precision to the lowest precision.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the rounding scheme comprises: determining amedian precision from among any combination of the first precision, thesecond precision, and a target precision of the current block; androunding at least one of the first precision, the second precision, orthe target precision to the median precision.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the rounding scheme comprises: determining ahighest precision from among any combination of the first precision, thesecond precision, and a target precision of the current block; androunding at least one of the first precision, the second precision, orthe target precision to the highest precision.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the rounding scheme comprises: determining adefault precision; and rounding at least one of the first precision, thesecond precision, or a target precision of the current block to thedefault precision.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the pruning comprises discarding identicalcandidate MVs or sub-identical candidate MVs.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the pruning further comprises adding zero MVsto fill the candidate list.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the processor is further configured to furtherperform the first rounding and the second rounding before the pruning.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the processor is further configured to furtherperform the first rounding and the second rounding after the pruning.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the candidate list is an AMVP candidate list.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the candidate list is a merge candidate list.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the processor is configured to performinter-prediction using the one of the candidate MVs selected to generatea reconstructed block.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the reconstructed block is used to generate animage for display on a display screen of an electronic device.

According to another aspect of the present disclosure, there is provideda method comprising: receiving, by a receiver of the video decoder, anencoded bitstream containing a motion vector (MV) candidate index for acurrent block; obtaining, by a processor of the video decoder, candidatemotion vectors (MVs) corresponding to neighboring blocks of the currentblock, the neighboring blocks neighbor the current block; obtaining, bythe processor, precisions of candidate MVs corresponding to neighboringblocks of the current block; performing, by the processor, firstrounding of the precisions based on a rounding scheme; performing, bythe processor, second rounding of the candidate MVs based on the firstrounding; performing, by the processor, pruning of the candidate MVs;generating, by the processor, a candidate list based on the secondrounding and the pruning; and selecting, by the processor, one of thecandidate MVs from the candidate list for decoding the current blockbased on the MV candidate index.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the rounding scheme comprises rounding all ofthe precisions to a target precision, and wherein the second roundingcomprises rounding each of the candidate MVs to a multiple of the targetprecision.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the target precision is obtained from a sliceheader of the encoded bitstream.

According to another aspect of the present disclosure, there is provideda non-transitory computer readable medium comprising a computer programproduct for use by a video coding device, the computer program productcomprising computer executable instructions stored on the non-transitorycomputer readable medium such that when executed by a processor causethe video coding device to: receive an encoded bitstream containing amotion vector (MV) candidate index for a current block; obtain candidatemotion vectors (MVs) corresponding to neighboring blocks of the currentblock, the neighboring blocks neighbor the current block; obtainprecisions of candidate MVs corresponding to neighboring blocks of thecurrent block; perform first rounding of the precisions based on arounding scheme; perform second rounding of the candidate MVs based onthe first rounding; perform pruning of the candidate MVs; generate acandidate list based on the second rounding and the pruning; and selectone of the candidate MVs from the candidate list for decoding thecurrent block based on the MV candidate index.

Optionally, in any of the preceding aspects, another implementation ofthe aspect provides that the computer executable instructions furthercause the video coding device to: perform inter-prediction using the oneof the candidate MVs selected to generate a reconstructed block; andgenerate an image on a display of an electronic device using thereconstructed block.

Any of the above embodiments may be combined with any of the other aboveembodiments to create a new embodiment. These and other features will bemore clearly understood from the following detailed description taken inconjunction with the accompanying drawings and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of this disclosure, reference is nowmade to the following brief description, taken in connection with theaccompanying drawings and detailed description, wherein like referencenumerals represent like parts.

FIG. 1 is a schematic diagram of a coding system.

FIG. 2 is a diagram of a portion of a video frame.

FIG. 3 is a flowchart illustrating a method of candidate list generationaccording to an embodiment of the disclosure.

FIG. 4 is a flowchart illustrating a method of decoding according to anembodiment of the disclosure.

FIG. 5 is a schematic diagram of an apparatus according to an embodimentof the disclosure.

DETAILED DESCRIPTION

It should be understood at the outset that, although an illustrativeimplementation of one or more embodiments are provided below, thedisclosed systems and/or methods may be implemented using any number oftechniques, whether currently known or in existence. The disclosureshould in no way be limited to the illustrative implementations,drawings, and techniques illustrated below, including the exemplarydesigns and implementations illustrated and described herein, but may bemodified within the scope of the appended claims along with their fullscope of equivalents.

The following abbreviations and initialisms apply:

AMVP: advanced motion vector prediction

ASIC: application-specific integrated circuit

CPU: central processing unit

CTU: coding tree unit

DSP: digital signal processor

EO: electrical-to-optical

FPGA: field-programmable gate array

ITU: International Telecommunication Union

ITU-T: ITU Telecommunication Standardization Sector

LCD: liquid crystal display

MV: motion vector

OE: optical-to-electrical

PPS: picture parameter set

RAM: random-access memory

RF: radio frequency

ROM: read-only memory

RX: receiver unit

SPS: sequence parameter set

SRAM: static RAM

TCAM: ternary content-addressable memory

TX: transmitter unit.

FIG. 1 is a schematic diagram of a coding system 100. The coding system100 comprises a source device 110, a medium 150, and a destinationdevice 160. The source device 110 and the destination device 160 aremobile phones, tablet computers, desktop computers, notebook computers,or other suitable devices. The medium 150 is a local network, a radionetwork, the Internet, or another suitable medium.

The source device 110 comprises a video generator 120, an encoder 130,and an output interface 140. The video generator 120 is a camera oranother device suitable for generating video. The encoder 130 may bereferred to as a codec. The encoder 130 performs encoding according to aset of rules, for instance as described in “High Efficiency VideoCoding,” ITU-T H.265, December 2016 (“H.265”), which is incorporated byreference. The output interface 140 is an antenna or another componentsuitable for transmitting data to the destination device 160.Alternatively, the video generator 120, the encoder 130, and the outputinterface 140 are in any suitable combination of devices.

The destination device 160 comprises an input interface 170, a decoder180, and a display 190. The input interface 170 is an antenna or anothercomponent suitable for receiving data from the source device 110. Thedecoder 180 may also be referred to as a codec. The decoder 180 performsdecoding according to a set of rules, for instance as described inH.265. The display 190 is an LCD screen or another component suitablefor displaying videos. Alternatively, the input interface 170, thedecoder 180, and the display 190 are in any suitable combination ofdevices.

In operation, in the source device 110, the video generator 120 capturesa video, the encoder 130 encodes the video to create an encoded video,and the output interface 140 transmits the encoded video over the medium150 and towards the destination device 160. The source device 110 maylocally store the video or the encoded video, or the source device 110may instruct storage of the video or the encoded video on anotherdevice. The encoded video comprises data defined at various levels,including slices and blocks. A slice is a spatially distinct region of avideo frame that the encoder 130 encodes separately from any otherregion in the video frame. A block is a group of pixels arranged in arectangle, for instance an 8 pixel×8 pixel square. Blocks may also bereferred to as units or coding units. Other levels include regions,CTUs, and tiles. In the destination device 160, the input interface 170receives the encoded video from the source device 110, the decoder 180decodes the encoded video to obtain a decoded video, and the display 190displays the decoded video. The decoder 180 may decode the encoded videoin a reverse manner compared to how the encoder 130 encodes the video.The destination device 160 locally stores the encoded video or thedecoded video, or the destination device 160 instructs storage of theencoded video or the decoded video on another device.

Together, encoding and decoding are referred to as coding. Codingcomprises intra coding and inter coding, which may be referred to asintra prediction and inter prediction, respectively. Intra predictionimplements spatial prediction to reduce spatial redundancy within avideo frame. Inter prediction implements temporal prediction to reducetemporal redundancy between successive video frames.

FIG. 2 is a diagram of a portion 200 of a video frame. The portion 200comprises a current block 210 and neighboring blocks A₀ 220, A₁ 230, B₂240, B₁ 250, and B₀ 260. The current block 210 is called a current blockbecause the encoder 130 is currently encoding it. The neighboring blocks220-260 are called neighboring blocks because they neighbor the currentblock 210. The neighboring block A₀ 220 is in a bottom-left cornerposition, the neighboring block A₁ 230 is in a left-bottom sideposition, the neighboring block B₂ 240 is in a top-left corner position,the neighboring block B₁ 250 is in a top-right side position, and theneighboring block B₀ 260 is in a top-right corner position. In interprediction, the encoder 130 determines an MV of the current block 210based on MVs of the neighboring blocks 220-260. The MVs of theneighboring blocks 220-260 are already known when the encoder 130 isencoding the current block 210.

AMVP and merge are two coding modes the encoder 130 may use to determinethe MV of the current block 210. In AMVP, the encoder 130 determines anMV candidate list by sequentially scanning the neighboring blocks220-260 as follows: A₀ 220, A₁ 230, a scaled version of A₀ 220, a scaledversion of A₁ 230, B₀ 260, B₁ 250, B₂ 240, a scaled version of B₀ 260, ascaled version of B₁ 250, a scaled version of B₂ 240, a temporal bottomright collocated candidate, a temporal central collocated candidate, anda zero MV. From that candidate list, the encoder 130 selects the bestcandidate and indicates the best candidate in a signal to thedestination device 160. In merge, the encoder 130 determines a candidatelist of MVs by sequentially scanning the neighboring blocks as follows:A₁ 230, B₁ 250, B₀ 260, A₀ 220, B₂ 240, temporal bottom right collocatedcandidate, temporal central collocated candidate, and a zero MV. Fromthat candidate list, the encoder 130 selects the best candidate andindicates the best candidate in a signal to the destination device 160.Though AMVP and merge scan the neighboring blocks 220-260, other codingmodes may scan different neighboring blocks that are not shown.

Both AMVP and merge define precisions for MVs. Precisions indicate adistance between pixels that serves as a multiplier to define an MV. Inthe context of precisions, pixels may be referred to as pels. Thus,precisions include quarter-pel precision, half-pel precision,integer-pel precision, and four-pel precision. Quarter-pel precisiondefines an MV in terms of a quarter of a distance between pixels so thatthe MV may be 0.25, 0.5, 0.75, 1.0, 1.25, and so on. The encoder 130encodes precisions as flags in slice headers. A slice header is a headerat the beginning of a slice signal that indicates data applicable to theentire slice. Alternatively, the encoder 130 encodes precisions as flagsor other data in block headers.

Both AMVP and merge define rules for determining qualified candidatesfor their candidate lists. For instance, if two candidate MVs are thesame, then the encoder 130 removes one of those candidate MVs. Theencoder 130 continues applying those rules until it fills the candidatelists with a maximum number of allowed candidates. Those rules are welldefined when the candidate MVs have the same precision. However, it isdesirable to provide coding-efficient rules for candidate MVs withdifferent precisions.

Disclosed herein are embodiments for selection and signaling of MVprecisions. The embodiments provide for obtaining MVs with differentprecisions, rounding those precisions in a uniform manner, rounding MVs,and generating candidate lists. The embodiments further provide forsignaling precisions at the slice, region, CTU, or tile level. Theembodiments apply to AMVP, merge, and other suitable coding modes.

AMVP Candidate List Generation

In a first embodiment of AMVP candidate list generation, the encoder 130considers three precisions: a first precision of a first neighboringblock 220-260, a second precision of a second neighboring block 220-260,and a third precision of the current block 210. For instance, theencoder 130 considers precisions of the neighboring block 220, theneighboring block 230, and the current block 210. The third precisionmay be referred to as a target precision because it is associated withthe current block 210, which is a target of encoding. Using the threeprecisions, the encoder 130 executes the following pseudo code:

i = 0 if(availableFlagLXA) {   mvpListLX[ i++] = mvLXA  if(availableFlagLXB && (     RoundMvPrecisionToTarget(mvLXA)    RoundMvPrecisionToTarget(mvLXB)     mvLXA! = mvLXB)))   mvpListLX[i++ ] = mvLXB } else if(availableFlagLXB)   mvpListLX[i++] = mvLXB if( i< 2 && availableFlagLXCol)   mvpListLX[ i++] = mvLXCol while( i < 2 ) {  mvpListLX[i][0] = 0   mvpListLX[i][1] = 0   i++ }

The pseudo code implements the following rules: if the target precisionuses a highest precision, then the encoder 130 rounds up the firstprecision and the second precision to the target precision. If thetarget precision uses a lowest precision, then the encoder 130 roundsdown the first precision and the second precision to the targetprecision. Otherwise, the encoder 130 rounds up either the firstprecision or the second precision, whichever is lower, to the targetprecision, and the encoder 130 rounds down either the first precision orthe second precision, whichever is higher, to the target precision.Lower means numerically lower, and higher means numerically higher.Thus, a quarter-pel precision of 0.25 is lower than an integer-pelprecision of 1.0.

After rounding the precisions, the encoder 130 either rounds up orrounds down the candidate MVs based on those precisions. For instance,if a candidate MV is 1.25 and has a native precision of 0.25, and if thetarget precision is 0.5, then the encoder 130 rounds up the candidate MVto 1.5. A native precision is a precision of an MV before the encoder130 rounds up or rounds down that precision per the pseudo code above.Finally, for each candidate MV, the encoder 130 determines whether anidentical candidate MV or a sub-identical candidate MV is already in acandidate list. If not, then the encoder 130 adds the candidate MV tothe candidate list. If so, then the encoder 130 discards the candidateMV. Sub-identical means identical within a pre-defined threshold.

In a first alternative, RoundMvPrecisionToLow( ) replacesRoundMvPrecisionToTarget( ) in the pseudo code so that the encoder 130determines a lowest precision from among the first precision, the secondprecision, and the target precision, then rounds down either the firstprecision, the second precision, or both the first precision and thesecond precision to that precision. In a second alternative,RoundMvPrecisionToLow( ) replaces RoundMvPrecisionToTarget( ) in thepseudo code so that the encoder 130 determines a lowest precision fromamong the first precision and the second precision, then rounds downeither the first precision or the second precision, whichever remains,to that precision. In a third alternative, RoundMvPrecisionToHigh( )replaces RoundMvPrecisionToTarget( ) in the pseudo code so that theencoder 130 determines a highest precision from among the firstprecision, the second precision, and the target precision, then roundsup the first precision, the second precision, or both the firstprecision and the second precision to that precision. In a fourthalternative, RoundMvPrecisionToHigh( ) replacesRoundMvPrecisionToTarget( ) in the pseudo code so that the encoder 130determines a highest precision from among the first precision and thesecond precision, then rounds up either the first precision or thesecond precision, whichever remains, to that precision.

In a fifth alternative, RoundMvPrecisionToDefault( ) replacesRoundMvPrecisionToTarget( ) in the pseudo code so that the encoder 130rounds up or rounds down the first precision and the second precision toa default precision. The encoder 130 may first receive the defaultprecision in a signal from another device. In a sixth alternative,RoundMvPrecisionToMedian( ) replaces RoundMvPrecisionToTarget( ) in thepseudo code so that the encoder 130 determines a median precision fromamong the first precision, the second precision, and the targetprecision, then rounds up or rounds down the first precision, the secondprecision, or both the first precision and the second precision to thatprecision. If the encoder 130 considers an even number of precisions,then the median precision may be an average of the two medianprecisions.

In a second embodiment of AMVP candidate list generation, the encoder130 considers the target precision of the current block 210. Using thetarget precision, the encoder 130 executes the following pseudo code:

i = 0 if(availableFlagLXA) {   mvpListLX[i++] = mvLXA  if(availableFlagLXB && (mvLXA != mvLXB))     mvpListLX[i++] = mvLXB }else if(availableFlagLXB)   mvpListLX[i++] = mvLXB if(i < 2 &&availableFlagLXCol)   mvpListLX[i++] = mvLXCol if(i == 2) if(diffMotion(mvLXM, mvLXN)) i−− while(i < 2) {   mvpListLX[i][0] = 0  mvpListLX i][1] = 0   i++ }In the pseudo code, mvLXM and mvLXN in diffMotion( ) may be mvLXA,mvLXB, or mvLXCol.

The pseudo code implements the following rules for diffMotion( ): foreach candidate MV, the encoder 130 determines whether an identicalcandidate MV or a sub-identical candidate MV is already in a candidatelist. If not, then the encoder adds the candidate MV to the candidatelist. If so, then the encoder 130 discards the candidate MV. Thus, theencoder 130 first considers the candidate MVs in their nativeprecisions.

After removing identical candidate MVs or sub-identical candidate MVs,if a target precision uses a highest precision, then the encoder 130rounds up candidate precisions to the target precision. The candidateprecisions are precisions of the neighboring blocks 220-260. If a targetprecision uses a lowest precision, then the encoder 130 rounds down thecandidate precisions to the target precision. Otherwise, the encoder 130rounds up lower candidate precisions to the target precision, and theencoder 130 rounds down higher candidate precisions to the targetprecision.

After rounding the precisions, the encoder 130 either rounds up orrounds down the candidate MVs based on those precisions. For eachcandidate MV, the encoder 130 determines whether an identical candidateMV or a sub-identical candidate MV is already in a candidate list. Ifnot, then the encoder 130 keeps the candidate MV in the candidate list.If so, then the encoder 130 discards the candidate MV from the candidatelist. If diffMotion( ) returns 1, then two candidate MVs are notidentical or sub-identical. If diffMotion( ) returns 0, then twocandidate MVs are identical or sub-identical. Finally, if the candidatelist is not full, then the encoder 130 inserts candidate MVs of a 0value to fill the missing spots. For instance, if the candidate list isto have 10 MVs, but only 8 MVs are left in the candidate list, then theencoder inserts 2 MVs with a 0 value.

In a first alternative, diffMotion( ) operates so that the encoder 130determines a lowest precision from among a first precision of a firstneighboring block 220-260, a second precision of a second neighboringblock 220-260, and the target precision, then rounds down all remainingcandidate precisions to that precision. In a second alternative,diffMotion( ) operates so that the encoder 130 determines a highestprecision from among the first precision, the second precision, and thetarget precision, then rounds up all remaining candidate precisions tothat precision. In a third alternative, diffMotion( ) operates so thatthe encoder 130 rounds up or rounds down the candidate precisions to adefault precision. The encoder 130 may first receive the defaultprecision in a signal from another device. In a fourth alternative,diffMotion( ) operates so that the encoder 130 determines a medianprecision from among the first precision, the second precision, and thetarget precision, then rounds up or rounds down the first precision, thesecond precision, or both the first precision and the second precisionto that precision. If the encoder 130 considers an even number ofprecisions, then the median precision may be an average of the twomedian precisions.

In the above embodiments, after the encoder 130 generates an AMVPcandidate list, it may select a final candidate MV. The encoder 130 maydo so based on various criteria that are known. Once the encoder 130does so, the encoder 130 may signal the final candidate MV in theencoded video. Instead of comparing a first precision and a secondprecision, the encoder 130 may compare all candidate precisions.

Merge Candidate List Generation

In a first embodiment of merge candidate list generation, the encoder130 considers three precisions: a first precision of a first neighboringblock 220-260, a second precision of a second neighboring block 220-260,and a target precision of the current block 210. The first embodiment ofmerge candidate list generation is similar to the first embodiment ofAMVP candidate list generation. Using the three precisions, the encoder130 executes the following pseudo code:

i = 0 if(availableFlagA1)   mergeCandList[i++] =RoundMvPrecisionToTarget(A1) if(availableFlagB1 &&diffMotions(RoundMvPrecisionToTarget(B1)))   mergeCandList[i++] = B1if(availableFlagB0 && diffMotions(RoundMvPrecisionToTarget(B0)))  mergeCandList[i++] = B0 if(availableFlagA0 &&diffMotions(RoundMvPrecisionToTarget(A0)))   mergeCandList[i++] = A0if(availableFlagB2 && diffMotions(RoundMvPrecisionToTarget(B2)))  mergeCandList[i++] = B2 if(availableFlagCol)   mergeCandList[i++] =  diffMotions(RoundMvPrecisionToTarget(Col)))

The pseudo code implements the following rules for diffMotions( ): Ifthe target precision uses a highest precision, then the encoder 130rounds up the first precision and the second precision to the targetprecision. If the target precision uses a lowest precision, then theencoder 130 rounds down the first precision and the second precision tothe target precision. Otherwise, the encoder 130 rounds up either thefirst precision or the second precision, whichever is lower, to thetarget precision, and the encoder 130 rounds down either the firstprecision or the second precision, whichever is higher, to the targetprecision.

After rounding the precisions, the encoder 130 either rounds up orrounds down the candidate MVs based on those precisions. Finally, foreach candidate MV, the encoder 130 determines whether an identicalcandidate MV or a sub-identical candidate MV is already in a candidatelist. If not, then the encoder 130 adds the candidate MV to thecandidate list. If so, then the encoder 130 discards the candidate MV.If diffMotion( ) returns 1, then two candidate MVs are not identical orsub-identical. If diffMotion( ) returns 0, then two candidate MVs areidentical or sub-identical.

In a first alternative, RoundMvPrecisionToLow( ) replacesRoundMvPrecisionToTarget( ) in the pseudo code so that the encoder 130determines a lowest precision from among the first precision, the secondprecision, and the target precision, then rounds down either the firstprecision, the second precision, or both the first precision and thesecond precision to that precision. In a second alternative,RoundMvPrecisionToLow( ) replaces RoundMvPrecisionToTarget( ) in thepseudo code so that the encoder 130 determines a lowest precision fromamong the first precision and the second precision, then rounds downeither the first precision or the second precision, whichever remains,to that precision. In a third alternative, RoundMvPrecisionToHigh( )replaces RoundMvPrecisionToTarget( ) in the pseudo code so that theencoder 130 determines a highest precision from among the firstprecision, the second precision, and the target precision, then roundsup the first precision, the second precision, or both the firstprecision and the second precision to that precision. In a fourthalternative, RoundMvPrecisionToHigh( ) replacesRoundMvPrecisionToTarget( ) in the pseudo code so that the encoder 130determines a highest precision from among the first precision and thesecond precision, then rounds up either the first precision or thesecond precision, whichever remains, to that precision.

In a fifth alternative, RoundMvPrecisionToDefault( ) replacesRoundMvPrecisionToTarget( ) in the pseudo code so that the encoder 130rounds up or rounds down the first precision and the second precision toa default precision. The encoder 130 may first receive the defaultprecision in a signal from another device. In a sixth alternative,RoundMvPrecisionToMedian( ) replaces RoundMvPrecisionToTarget( ) in thepseudo code so that the encoder 130 determines a median precision fromamong the first precision, the second precision, and the targetprecision, then rounds up or rounds down the first precision, the secondprecision, or both the first precision and the second precision to thatprecision. If the encoder 130 considers an even number of precisions,then the median precision may be an average of the two medianprecisions.

In a second embodiment of merge candidate list generation, the encoder130 considers the target precision of the current block 210. The secondembodiment of merge candidate list generation is similar to the secondembodiment of AMVP candidate list generation. Using the targetprecision, the encoder 130 executes the following pseudo code:

i = 0 if(availableFlagA1)   mergeCandList[i++] = A1 if(availableFlagB1)  mergeCandList[i++] = B1 if(availableFlagB0)   mergeCandList[i++] = B0if(availableFlagA0)   mergeCandList[i++] = A0 if(availableFlagB2)  mergeCandList[i++] = B2 PruneList( ); if(availableFlagCol && i <max_num_candidates)   mergeCandList[i++] = Col

The pseudo code implements the following rules for PruneList( ): If atarget precision uses a highest precision, then the encoder 130 roundsup candidate precisions to the target precision. The candidateprecisions are precisions of the neighboring blocks 220-260. If a targetprecision uses a lowest precision, then the encoder 130 rounds down thecandidate precisions to the target precision. Otherwise, the encoder 130rounds up lower candidate precisions to the target precision, and theencoder 130 rounds down higher candidate precisions to the targetprecision.

After rounding the precisions, the encoder 130 either rounds up orrounds down the candidate MVs based on those precisions. For eachcandidate MV, the encoder 130 determines whether an identical candidateMV or a sub-identical candidate MV is already in a candidate list. Ifnot, then the encoder 130 adds the candidate MV to the candidate list.If so, then the encoder 130 discards the candidate MV and decrements iby 1. Finally, if the candidate list is not full, then the encoder 130inserts candidate MVs of a 0 value to fill the missing spots. Forinstance, if the candidate list is to have 10 MVs, but only 8 MVs areleft in the candidate list, then the encoder 130 inserts 2 MVs with a 0value.

In a first alternative, PruneList( ) operates so that the encoder 130determines a lowest precision from among a first precision of a firstneighboring block 220-260, a second precision of a second neighboringblock 220-260, and the target precision, then rounds down all remainingcandidate precisions to that precision. In a second alternative,PruneList( ) operates so that the encoder 130 determines a highestprecision from among the first precision, the second precision, and thetarget precision, then rounds up all remaining candidate precisions tothat precision. In a third alternative, PruneList( ) operates so thatthe encoder 130 rounds up or rounds down the candidate precisions to adefault precision. The encoder 130 may first receive the defaultprecision in a signal from another device. In a fourth alternative,PruneList( ) operates so that the encoder 130 determines a medianprecision from among the first precision, the second precision, and thetarget precision, then rounds up or rounds down the first precision, thesecond precision, or both the first precision and the second precisionto that precision. If the encoder 130 considers an even number ofprecisions, then the median precision may be an average of the twomedian precisions.

In a third embodiment of merge candidate list generation, the encoder130 considers the target precision of the current block 210. The thirdembodiment of merge candidate list generation is similar to the secondembodiment of merge candidate list generation. However, unlike thesecond embodiment of merge candidate list generation, which executesPruneList ( ) before checking the candidate list for identical candidateMVs or sub-identical candidate MVs, the third embodiment of mergecandidate list generation executes PruneList ( ) after checking acandidate list. Using the target precision, the encoder 130 executes thefollowing pseudo code:

i = 0 if(availableFlagA1)   mergeCandList[i++] = A1 if(availableFlagB1)  mergeCandList[i++] = B1 if(availableFlagB0)   mergeCandList[i++] = B0if(availableFlagA0)   mergeCandList[i++] = A0 if(availableFlagB2)  mergeCandList[i++] = B2 if(availableFlagCol)   mergeCandList[i++] =Col PruneList( )

In the above embodiments, after the encoder 130 generates a mergecandidate list, it may select a final candidate MV. The encoder 130 maydo so based on various criteria that are known. Once the encoder 130does so, the encoder 130 may signal the final candidate MV in theencoded video.

Precision Signaling

In a first embodiment of precision signaling, the encoder 130 encodes aprecision for MVs in a slice header as follows:

slice_segment_header( ) {   coding_mode_idx   mv_precision[coding_mode_idx ] }As shown, the slice header indicates a precision for all MVs for asingle coding mode, which may be either AMVP or merge.

In a second embodiment of precision signaling, the encoder 130 encodes aprecision for MVs in a slice header as follows:

slice_segment_header( ) {   num_coding_mode   for(i = 0; i <num_coding_mode; i++) {     coding_mode_idx    mv_precision_used_by_coding_mode[coding_mode_idx]   } }As shown, the slice header indicates a precision for all MVs formultiple coding modes, which may include AMVP and merge.

In a third embodiment of precision signaling, the encoder 130 encodes aprecision for MVs in a slice header as follows:

slice_segment_header( ) {   if( motion_vector_resolution_control_idc = =3 ) {     num_mv_precision     for( i = 0; i < num_mv_precision; i++ ) {      mv_precision_idx[i]     }   } }As shown, the slice header indicates a precision for all MVs formultiple coding modes, which may include AMVP and merge. The thirdembodiment of signaling is similar to the second embodiment ofsignaling, but uses a different syntax.

In a fourth embodiment of precision signaling, the encoder 130 encodes aprecision for MVs in a coding unit header as follows:

coding_unit( x0, y0, log2CbSize ) {   if(motion_vector_resolution_control_idc = = 3 ) {    mv_precision_idx_used_by_coding_mode   } }As shown, the coding unit header indicates a precision for all MVs for asingle coding mode, which may be either AMVP or merge.

In a fifth embodiment of precision signaling, the encoder 130 encodes aprecision for MVs in a coding unit header as follows:

coding_unit( x0, y0, log2CbSize ) {  if(motion_vector_resolution_control_idc = = 3) {     num_coding_mode    for(i = 0; i < num_coding_mode; i++) {       coding_mode_idx      mv_precision_idx_used_by_coding_mode       [coding_mode_idx]     }  } }As shown, the coding unit header indicates a precision for all MVs formultiple coding modes, which may include AMVP and merge.

In a sixth embodiment of precision signaling, the encoder 130 encodesall allowed precisions in an SPS in a form such as {mvr1, mvr2, . . . ,mvrN}. For each slice header, the encoder 130 also encodes a sliceheader index indicating one of those precisions that is to apply to allblocks in the corresponding slice. For instance, the SPS is{quarter-pel, integer-pel, four-pel} and a slice header index is either00 indicating quarter-pel, 01 indicating integer-pel, or 11 indicatingfour-pel.

In a seventh embodiment of precision signaling, the encoder 130 encodesall allowed precisions in an SPS in a form such as {mvr1, mvr2, . . . ,mvrN}. For each slice header, the encoder 130 also encodes multipleslice header indices indicating which of those precisions are to applyto blocks in the corresponding slice. For instance, the SPS is{quarter-pel, integer-pel, four-pel} and the slice header indices areany combination of 00 indicating quarter-pel, 01 indicating integer-pel,and 11 indicating four-pel.

In an eighth embodiment of precision signaling, the encoder 130 encodesall allowed precisions in an SPS in a form such as {mvr1, mvr2, . . . ,mvrN}. For each slice header, the encoder 130 also encodes a sliceheader index indicating a subset of those precisions that are to applyto blocks in the corresponding slice. For instance, the SPS is{quarter-pel, integer-pel, four-pel} and the slice header index is 00indicating {quarter-pel, integer-pel}, 01 indicating {quarter-pel,four-pel}, or 10 indicating {integer-pel, four-pel}.

In a ninth embodiment of precision signaling, the encoder 130 encodesall allowed precisions in an SPS in a form such as {mvr1, mvr2, . . . ,mvrN}. For each slice header, the encoder 130 also encodes a sliceheader index indicating one of those precisions, in addition to itsimmediate finer or coarser precision, that are to apply to blocks in thecorresponding slice. For instance, the SPS is {quarter-pel, integer-pel,four-pel}, and the slice header index is 00 indicating {quarter-pel}, 01indicating {quarter-pel, integer-pel}, or 10 indicating {integer-pel,four-pel} when the slice header indicates a finer precision or the sliceheader index is 00 indicating {quarter-pel, integer-pel}, 01 indicating{integer-pel, four-pel}, or 10 indicating {four-pel} when the sliceheader indicates a coarser precision.

In a tenth embodiment of precision signaling, the encoder 130 encodesall allowed precisions in an SPS in a form such as {mvr1, mvr2, . . . ,mvrN}. For each slice header, the encoder 130 also encodes a sliceheader index indicating which of those precisions are to apply to blocksin the corresponding slice. For each block header, the encoder 130 alsoencodes a block header index indicating one of those precisions that isto apply to the corresponding block. For instance, the SPS is{quarter-pel, integer-pel, four-pel}, a first slice header index of 0indicates {quarter-pel, integer-pel}, a first block header index of 0 inthe first slice header indicates quarter-pel, a second block headerindex of 1 in the first slice header indicates integer-pel, a secondslice header index of 1 indicates {integer-pel, four-pel}, a third blockheader index of 0 in the second slice header indicates integer-pel, anda fourth block header index of 1 in the second slice header indicatesfour-pel.

In the above embodiments, instead of encoding header indices at theslice level, the encoder 130 may encode the header indices at the regionlevel, CTU level, or tile level. Though the indices are expressed asspecific binary numbers, any binary numbers or other numbers may beused. Instead of indicating all precisions in an SPS, the encoder 130may indicate all the precisions in a PPS. Instead of comparing a firstprecision and a second precision, the encoder 130 may compare allcandidate precisions.

FIG. 3 is a flowchart illustrating a method 300 of candidate listgeneration according to an embodiment of the disclosure. The encoder 130performs the method 300. At step 310, a current block of a video isobtained. For instance, the encoder 130 obtains the current block 210.At step 320, candidate MVs corresponding to neighboring blocks of thevideo are obtained. The neighboring blocks neighbor the current block.For instance, the encoder 130 obtains candidate MVs corresponding to theneighboring blocks 220-260. At step 330, precisions of the candidate MVsare obtained.

At step 340, first rounding of the precisions is performed based on arounding scheme. For instance, the rounding scheme is one of therounding schemes described above. Thus, the rounding scheme may compriserounding to a target precision; rounding to a lowest precision, a medianprecision, or a highest precision from among precisions of theneighboring blocks 220-260; rounding to a lowest precision, a medianprecision, or a highest precision from among precisions of theneighboring blocks 220-260 and the target block; or rounding to adefault precision. At step 350, second rounding of the candidate MVs isperformed based on the first rounding. For instance, the encoder 130determines a precision from step 340 and either rounds up or rounds downthe candidate MVs based on that precision.

At step 360, pruning of the candidate MVs is performed. For instance,the pruning is completed as described above. Thus, the pruning maycomprise discarding identical candidate MVs, discarding sub-identicalcandidate MVs, or adding zero MVs to fill a candidate list. Finally, atstep 370, a candidate list is generated based on the second rounding andthe pruning. The candidate list may be an AMVP candidate list or a mergecandidate list as described above.

FIG. 4 is a flowchart illustrating a method 400 of decoding according toan embodiment of the disclosure. The decoder 180 performs the method400. At step 410, an encoded bitstream containing an MV candidate indexfor a current block is received. The MV candidate index identifies whichof the MV candidates was used for encoding the current block, asdescribed above.

At step 420, candidate MVs corresponding to neighboring blocks of thevideo are obtained. The neighboring blocks neighbor the current block.For instance, the decoder 180 obtains candidate MVs corresponding to theneighboring blocks 220-260. At step 430, precisions of candidate MVs areobtained.

At step 440, first rounding of the precisions is performed based on arounding scheme. For instance, the rounding scheme is one of therounding schemes described above. Thus, the rounding scheme may compriserounding to a target precision; rounding to a lowest precision, a medianprecision, or a highest precision from among precisions of theneighboring blocks 220-260; rounding to a lowest precision, a medianprecision, or a highest precision from among precisions of theneighboring blocks 220-260 and the target block; or rounding to adefault precision. At step 450, second rounding of the candidate MVs isperformed based on the first rounding. For instance, the decoder 180determines a precision from step 440 and either rounds up or rounds downthe candidate MVs based on that precision.

At step 460, pruning of the candidate MVs is performed. For instance,the pruning is completed as described above. Thus, the pruning maycomprise discarding identical candidate MVs, discarding sub-identicalcandidate MVs, or adding zero MVs to fill a candidate list. At step 470,a candidate list is generated based on the second rounding and thepruning. The candidate list may be an AMVP candidate list or a mergecandidate list as described above.

In step 480, one of the candidate MVs is selected from the candidatelist for decoding the current block based on the MV candidate index. Inan embodiment, the decoder 180 performs inter-prediction using thecandidate MV that was selected to generate a reconstructed block. Thedecoder 180 can then generate an image on a display of an electronicdevice using the reconstructed block.

FIG. 5 is a schematic diagram of an apparatus 500 according to anembodiment of the disclosure. The apparatus 500 may implement thedisclosed embodiments. The apparatus 500 comprises ingress ports 510 andan RX 520 for receiving data; a processor, logic unit, baseband unit, orCPU 530 to process the data; a TX 540 and egress ports 550 fortransmitting the data; and a memory 560 for storing the data. Theapparatus 500 may also comprise OE components, EO components, or RFcomponents coupled to the ingress ports 510, the RX 520, the TX 540, andthe egress ports 550 for ingress or egress of optical, electricalsignals, or RF signals.

The processor 530 is any combination of hardware, middleware, firmware,or software. The processor 530 comprises any combination of one or moreCPU chips, cores, FPGAs, ASICs, or DSPs. The processor 530 communicateswith the ingress ports 510, the RX 520, the TX 540, the egress ports550, and the memory 560. The processor 530 comprises a coding component570, which implements the disclosed embodiments. The inclusion of thecoding component 570 therefore provides a substantial improvement to thefunctionality of the apparatus 500 and effects a transformation of theapparatus 500 to a different state. Alternatively, the memory 560 storesthe coding component 570 as instructions, and the processor 530 executesthose instructions.

The memory 560 comprises any combination of disks, tape drives, orsolid-state drives. The apparatus 500 may use the memory 560 as anover-flow data storage device to store programs when the apparatus 500selects those programs for execution and to store instructions and datathat the apparatus 500 reads during execution of those programs. Thememory 560 may be volatile or non-volatile and may be any combination ofROM, RAM, TCAM, or SRAM.

In an example embodiment, an apparatus comprises: a memory element; anda processor element coupled to the memory element and configured to:obtain a current block of a video frame, obtain candidate MVscorresponding to neighboring blocks of the video frame, the neighboringblocks neighbor the current block, obtain precisions of the candidateMVs, perform first rounding of the precisions based on a roundingscheme, perform second rounding of the candidate MVs based on the firstrounding, perform pruning of the candidate MVs, and generate a candidatelist based on the second rounding and the pruning.

While several embodiments have been provided in the present disclosure,it may be understood that the disclosed systems and methods might beembodied in many other specific forms without departing from the spiritor scope of the present disclosure. The present examples are to beconsidered as illustrative and not restrictive, and the intention is notto be limited to the details given herein. For example, the variouselements or components may be combined or integrated in another systemor certain features may be omitted, or not implemented.

In addition, techniques, systems, subsystems, and methods described andillustrated in the various embodiments as discrete or separate may becombined or integrated with other systems, components, techniques, ormethods without departing from the scope of the present disclosure.Other items shown or discussed as coupled may be directly coupled or maybe indirectly coupled or communicating through some interface, device,or intermediate component whether electrically, mechanically, orotherwise. Other examples of changes, substitutions, and alterations areascertainable by one skilled in the art and may be made withoutdeparting from the spirit and scope disclosed herein.

What is claimed is:
 1. A decoder comprising: a receiver configured toreceive an encoded bitstream containing a motion vector (MV) candidateindex for a current block; and a processor coupled to the receiver, theprocessor configured to: obtain candidate motion vectors (MVs)corresponding to neighboring blocks of the current block, theneighboring blocks neighboring the current block; obtain precisions ofthe candidate MVs; round the precisions to a target precision based on arounding scheme; round the candidate MVs based on the target precisionfirst rounding; perform pruning of the candidate MVs; generate acandidate list based on the second rounding of the candidate MVs and thepruning; and select one of the candidate MVs from the candidate list fordecoding the current block based on the MV candidate index.
 2. Thedecoder of claim 1, wherein the neighboring blocks comprise a firstneighboring block and a second neighboring block, and wherein theprecisions comprise a first precision of the first neighboring block anda second precision of the second neighboring block.
 3. The decoder ofclaim 2, wherein the rounding scheme comprises: rounding the firstprecision to the target precision of the current block; and rounding thesecond precision to the target precision.
 4. The decoder of claim 2,wherein the rounding scheme comprises: determining a lowest precisionfrom among any combination of the first precision, the second precision,and the target precision of the current block; and rounding at least oneof the first precision, the second precision, or the target precision tothe lowest precision.
 5. The decoder of claim 2, wherein the roundingscheme comprises: determining a median precision from among anycombination of the first precision, the second precision, and the targetprecision of the current block; and rounding at least one of the firstprecision, the second precision, or the target precision to the medianprecision.
 6. The decoder of claim 2, wherein the rounding schemecomprises: determining a highest precision from among any combination ofthe first precision, the second precision, and the target precision ofthe current block; and rounding at least one of the first precision, thesecond precision, or the target precision to the highest precision. 7.The decoder of claim 2, wherein the rounding scheme comprises:determining a default precision; and rounding at least one of the firstprecision, the second precision, or the target precision of the currentblock to the default precision.
 8. The decoder of claim 1, wherein thepruning comprises discarding identical candidate MVs or sub-identicalcandidate MVs.
 9. The decoder of claim 8, wherein the pruning furthercomprises adding zero MVs to fill the candidate list.
 10. The decoder ofclaim 1, wherein the processor is further configured to round theprecisions and round the candidate MVs before the pruning.
 11. Thedecoder of claim 1, wherein the processor is further configured to roundthe precisions and round the candidate MVs after the pruning.
 12. Thedecoder of claim 1, wherein the candidate list is an advanced motionvector prediction (AMVP) candidate list.
 13. The decoder of claim 1,wherein the candidate list is a merge candidate list.
 14. The decoder ofclaim 1, wherein the processor is configured to perform inter-predictionusing the one of the candidate MVs selected to generate a reconstructedblock.
 15. The decoder of claim 14, wherein the reconstructed block isused to generate an image for display on a display screen of anelectronic device.
 16. A method implemented in a video decoder,comprising: receiving, by a receiver of the video decoder, an encodedbitstream containing a motion vector (MV) candidate index for a currentblock; obtaining, by a processor of the video decoder, candidate motionvectors (MVs) corresponding to neighboring blocks of the current block,the neighboring blocks neighboring the current block; obtaining, by theprocessor, precisions of candidate MVs; rounding, by the processor, theprecisions to a target precision based on a rounding scheme; rounding,by the processor, the candidate MVs based on the target precision firstrounding; performing, by the processor, pruning of the candidate MVs;generating, by the processor, a candidate list based on the rounding ofthe candidate MVs and the pruning; and selecting, by the processor, oneof the candidate MVs from the candidate list for decoding the currentblock based on the MV candidate index.
 17. The method of claim 16,wherein the rounding scheme comprises rounding all of the precisions tothe target precision, and wherein the rounding of the candidate MVscomprises rounding each of the candidate MVs to a multiple of the targetprecision.
 18. The method of claim 17, wherein the target precision isobtained from a slice header of the encoded bitstream.
 19. Anon-transitory computer readable medium comprising a computer programproduct for use by a video coding device, the computer program productcomprising computer executable instructions stored on the non-transitorycomputer readable medium such that when executed by a processor causethe video coding device to: receive an encoded bitstream containing amotion vector (MV) candidate index for a current block; obtain candidatemotion vectors (MVs) corresponding to neighboring blocks of the currentblock, the neighboring blocks neighboring the current block; obtainprecisions of candidate MVs corresponding to the neighboring blocks ofthe current block; round the precisions to a target precision based on arounding scheme; round the candidate MVs based on the target precision;perform pruning of the candidate MVs; generate a candidate list based onthe rounding of the candidate MVs and the pruning; and select one of thecandidate MVs from the candidate list for decoding the current blockbased on the MV candidate index.
 20. The non-transitory computerreadable medium of claim 19, wherein the computer executableinstructions further cause the video coding device to: performinter-prediction using the one of the candidate MVs selected to generatea reconstructed block; and generate an image on a display of anelectronic device using the reconstructed block.